/**
 * 
 */
package array.passed;

/**
 * @author xyyi
 *
 */
public class ContainerWithMostWater {

	/**
	Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

	Note: You may not slant the container.
	 */
	public int maxArea(int[] height) {
		int max = 0;
		if (height == null || height.length < 1) {
			return max;
		}

		int start = 0;
		int end = height.length - 1;
		while (start < end) {
			int currVolum = Math.min(height[start], height[end])
					* (end - start);
			max = Math.max(max, currVolum);
			if (height[start] < height[end]) {
				start++;
			} else {
				end--;
			}
		}

		return max;
	}

	/**
	 * 
	 */
	public ContainerWithMostWater() {
		// TODO Auto-generated constructor stub
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		ContainerWithMostWater cmw = new ContainerWithMostWater();
		int[] height = { 1, 2, 4, 3 };
		cmw.maxArea(height);

	}

}
